Generalizing ‘‘Search’’ in Generalized Search Trees
نویسنده
چکیده
The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. In this paper, we show how a small number of additional interfaces enable GiST to support a much larger class of operations. Members of this class, which includes nearestneighbor and ranked search, user-defined aggregation and index-assisted selectivity estimation, are increasingly common in new database applications. The advantages of implementing these operations in the GiST framework include reduction of user development effort and the ability to use ‘‘industrial strength’’ concurrency and recovery mechanisms provided by expert implementors.
منابع مشابه
P´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملOn Integer Sequences Derived from Balanced k-ary trees
This article investigates numerous integer sequences derived from two special balanced k-ary trees. Main contributions of this article are two fold. The first one is building a taxonomy of various balanced trees. The other pertains to discovering new integer sequences and generalizing existing integer sequences to balanced k-ary trees. The generalized integer sequence formulae for the sum of he...
متن کاملGeneralizing Ordering-search for Learning Directed Probabilistic Logical Models
Recently, there has been an increasing interest in directed probabilistic logical models and a variety of such languages has been proposed. Although many authors provide high-level arguments to show that in principle models in their language can be learned from data, most such learning algorithms have not yet been studied in detail. We propose an algorithm to learn both structure and conditiona...
متن کامل